Eecient Parsing of Fixed-mode Dcgs
نویسندگان
چکیده
In this paper we describe an eecient parsing model for monotonous xed-mode DCGs, including traversing of cyclic terms. The algorithm can be viewed as an extension of the classic push-down automaton model in dynamic programming along with the incorporation of a mechanism for detecting and traversing cyclic trees. Details of implementation and experimental tests are described. Experimental results show the performance of our approach.
منابع مشابه
Slr Inference : an Inference Systemfor Fixed - Mode Logic Programs , Based on Slr
Deenite-clause grammars (DCGs) generalize context-free grammars in such a way that Prolog can be used as a parser in the presence of context-sensitive information. Prolog's proof procedure, however, is based on back-tracking, which may be a source of ineeciency. Parsers for context-free grammars which use backtracking, for instance, were soon replaced by more eecient methods such as LR parsers....
متن کاملLHIP: Extended DCGs for Configurable Robust Parsing
We present LHIP, a system for incremental grammar development using an extended DCG formalism. The system uses a robust island-based parsing method controlled by user-defined performance thresholds.
متن کاملAn improved joint model: POS tagging and dependency parsing
Dependency parsing is a way of syntactic parsing and a natural language that automatically analyzes the dependency structure of sentences, and the input for each sentence creates a dependency graph. Part-Of-Speech (POS) tagging is a prerequisite for dependency parsing. Generally, dependency parsers do the POS tagging task along with dependency parsing in a pipeline mode. Unfortunately, in pipel...
متن کاملAssumption Grammars: Parsing as Hypothetical Reasoning
A general framework of handling state information for logic programming languages on top of backtrackable assumptions (linear aane and intuition-istic implications ranging over the current continuation) is introduced, with emphasis on its high-level natural language processing abilities. Assumption Grammars (AGs), a variant of Extended DCGs particularly suitable for hypothetical reasoning, and ...
متن کاملPreference Logic Grammars
Preference logic grammars (PLGs) are introduced in this paper as a declarative means of resolving ambiguity in logic grammars. Preference logic grammars can be thought as extensions of deenite clause grammars (DCGs) and deenite-clause translation grammars (DCTGs). Just as DCGs and DCTGs can be directly translated into logic programs, PLGs can be translated into preference logic programs (PLPs),...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997